Two categories of effective continuous cpos

نویسندگان

  • Göran Hamrin
  • Viggo Stoltenberg-Hansen
چکیده

This paper presents two categories of effective continuous cpos. We define a new criterion on the basis of a cpo as to make the resulting category of consistently complete continuous cpos cartesian closed. We also generalise the definition of a complete set, used as a definition of effective bifinite domains in [HSH02], and investigate what closure results that can be obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective cartesian closed categories of domains

Perhaps the most important and striking fact of domain theory is that important categories of domains are cartesian closed. This means that the category has a terminal object, finite products, and exponents. The only problematic part for domains is the exponent, which in this setting means the space of continuous functions. Cartesian closed categories of domains are well understood and the unde...

متن کامل

A characterisation of the least - xed - point operatorby

The paper addresses the question of when the least-xed-point operator, in a cartesian closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a suucient condition on a cartesian closed full subcategory of the category of algebraic cpos for the characterisation to hold. The condition is quite mild, and...

متن کامل

An Axiomatisation of Computationally Adequate Domain Theoretic Models of FPC

Categorical models of the metalanguage FPC (a type theory with sums, products, exponentials and recursive types) are defined. Then, domain-theoretic models of FPC are axiomatised and a wide subclass of them —the non-trivial and absolute ones— are proved to be both computationally sound and adequate. Examples include: the category of cpos and partial continuous functions and functor categories o...

متن کامل

A Characterisation of the Least-Fixed-Point Operator by Dinaturality

Simpson, A.K., A characterisation of the least-fixed-point operator by dinaturality, Theoretical Computer Science 118 (1993) 301-314. The paper addresses the question of when the least-fixed-point operator, in a Cartesian-closed category of domains, is characterised as the unique dinatural transformation from the exponentiation bifunctor to the identity functor. We give a sufficient condition o...

متن کامل

Prevision Domains and Convex Powercones

Two recent semantic families of models for mixed probabilistic and non-deterministic choice over a space X are the convex powercone models, due independently to Mislove, and to Tix, Keimel, and Plotkin, and the continuous prevision model of the author. We show that, up to some minor details, these models are isomorphic whenever X is a continuous, coherent cpo, and whether the particular brand o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 365  شماره 

صفحات  -

تاریخ انتشار 2006